A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars
نویسندگان
چکیده
منابع مشابه
A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars
This paper describes the design and implementation of a Python-based interface for wide coverage Lexicalized Tree-adjoining Grammars. The grammars are part of the XTAGGrammar project at the University of Pennsylvania, which were hand-written and semi-automatically curated to parse real-world corpora. We provide an interface to the wide coverage English and Korean XTAG grammars. Each XTAG gramma...
متن کاملStochastic Lexicalized Tree-adjoining Grammars
The notion of stochastic lexicalized tree-adjoining g rammar (SLTAG) is formally defined. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and novel since it is lexieally sensitive (as N-gram models or Hidden Markov Models) and yet hierarchical (as stochastic context-free grammars) . Then...
متن کاملTree-adjoining grammars and lexicalized grammars
In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state some of the recent results about TAGs. The work on TAGS is motivated by linguistic considerations. However, a number of formal results have been established for TAGs, which we believe, would be of interest to researchers in tree grammars and tree automata. After giving a short introduction to TA...
متن کاملWide-Coverage Lexicalized Grammars
This paper proposes a hierarchical organization of the linguistic knowledge, that views grammar as an abstraction of item-dependent information (in particular, an abstraction of subcategorization frames into a hierarchy of classes). The formalism has been successfully applied to a classiication of 105 Italian verbal frames, developed by analysing a corpus of about 500,000 words. The proposed fr...
متن کاملBidirectional Parsing Of Lexicalized Tree Adjoining Grammars
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy: it works bottom-up from the lexical anchors and then expands (partial) analyses making top-down ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Prague Bulletin of Mathematical Linguistics
سال: 2015
ISSN: 1804-0462
DOI: 10.1515/pralin-2015-0008